Reversibility of Linear Cellular Automata on Cayley Trees with Periodic Boundary Condition

While one-dimensional cellular automata have been well studied, there are relatively few results about multidimensional cellular automata; the investigation of cellular automata defined on Cayley trees constitutes an intermediate class. This paper studies the reversibility of linear cellular automata defined on Cayley trees with periodic boundary condition, where the local rule is given by f(x0, x1, . . . , xd) = bx0+c1x1+ ⋯+ cdxd (mod m) for some integers m,d ≥ 2. The reversibility problem relates to solving a polynomial derived from a recurrence relation, and an explicit formula is revealed; as an example, the complete criteria of the reversibility of linear cellular automata defined on Cayley trees over Z2, Z3, and some other specific case are addressed. Further, this study achieves a possible approach for determining the reversibility of multidimensional cellular automata, which is known as a undecidable problem.